Dynamic problem - PDFSEARCH.IO - Document Search Engine

Dynamic problem
Results: 444

#	Item
411	A Dynamic Programming Approach for a Travelling Purchaser Problem With Additional Constraints Add to Reading List Source URL: www.di.unipi.it Language: English - Date: 2009-02-14 05:38:38 Applied mathematics Convex optimization Theoretical computer science Combinatorial optimization Travelling salesman problem Dynamic programming Subgradient method Relaxation Linear programming Mathematical optimization Mathematics Operations research
412	The Canadian Airline Problem and the Bitonic Tour Add to Reading List Source URL: www.researchgate.net Language: English C++ Object-oriented programming Dynamic programming Virtual function Sequence container C++ classes Stack Reference Iterator Computer programming Software engineering Computing
413	Who Solved the Secretary Problem? Author(s): Thomas S. Ferguson Source: Statistical Science, Vol. 4, No. 3 (Aug., 1989), pp[removed] Add to Reading List Source URL: www.math.upenn.edu Language: English - Date: 2010-11-27 22:04:39 Dynamic programming Secretary problem Operations research Systems engineering Optimal stopping Stability Loop-erased random walk XTR Statistics Mathematical optimization Decision theory
414	CATS 2002 Preliminary Version Efficient Algorithms for the Maximum Add to Reading List Source URL: www.cosc.canterbury.ac.nz Language: English - Date: 2003-02-10 18:47:35 Numerical linear algebra Dynamic programming Analysis of algorithms Computational complexity theory Matrix theory Maximum subarray problem Matrix Time complexity Shortest path problem Mathematics Theoretical computer science Algebra
415	7KH6HFUHWDU\3UREOHPDQG,WV([WHQVLRQV$5HYLHZ $XWKRUV35)UHHPDQ 6RXUFH,QWHUQDWLRQDO6WDWLVWLFDO5HYLHZ5HYXH,QWHUQDWLRQDOHGH6WDWLVWLTXH9RO1R Add to Reading List Source URL: isites.harvard.edu Language: English - Date: 2011-02-02 00:31:01 Equations Mathematical optimization Decision theory Optimal control Secretary problem Dynamic programming Bellman equation Kalman filter Statistics Systems theory Control theory
416	The Rise and Fall of Knapsack Cryptosystems A. M. Odlyzko AT&T Bell Laboratories Add to Reading List Source URL: www.dtc.umn.edu Language: English - Date: 1998-04-13 22:11:38 Public-key cryptography Dynamic programming Cryptography Combinatorial optimization Mathematical optimization Merkle–Hellman knapsack cryptosystem Knapsack problem P versus NP problem Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics
417	Chapter 6 Dynamic programming Add to Reading List Source URL: www.cs.berkeley.edu Language: English - Date: 2006-10-03 04:59:37 Dynamic programming Operations research Mathematical optimization Equations Systems engineering Algorithm Shortest path problem Longest increasing subsequence Topological sorting Mathematics Applied mathematics Graph theory
418	Lecture Notes CMSC 251 Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2009-08-29 21:25:16 Dynamic programming Routing algorithms Network theory Combinatorics Floyd–Warshall algorithm NP-complete problems Shortest path problem Longest common subsequence problem Algorithm Mathematics Theoretical computer science Applied mathematics
419	Secretary Problems October 21, 2010 Add to Reading List Source URL: www.dim.uchile.cl Language: English - Date: 2013-08-08 17:44:23 Secretary problem Mathematical optimization Markov models Dynamic programming Operations research Markov chain Combinatorics Combinatorial optimization Backward induction Statistics Probability and statistics Decision theory
420	Dynamic Programming vs. Divide-&-conquer • Add to Reading List Source URL: users.cis.fiu.edu Language: English - Date: 2007-11-01 16:16:04 Dynamic programming Operations research NP-complete problems Combinatorial optimization Mathematical optimization Knapsack problem Greedy algorithm Algorithm Overlapping subproblems Mathematics Applied mathematics Theoretical computer science

UPDATE